FP‐BFT: A fast pipeline Byzantine consensus algorithm

The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency presence malicious nodes. However, BFT are confronted with low efficiency and scalability problems caused by multiple rounds handshake communication. In this paper, a pipeline-based Fast Pipeline Tolerance algorithm (FP-BFT) is proposed, which adopts non-leader pipeline framework process different transactions parallel. By means randomly selecting 2f+1 nodes form committee for one round transactions, agreement can be reached within via broadcasting voting. Committee participating chosen chance avoid monopoly becomes block producer. Consensus throughput significantly improved framework. Comparison experiments conducted verify superiority FP-BFT algorithm, theoretical proof given guarantee fault-tolerant security. Experimental results show that has decreasing communication overhead make it better both public consortium systems.